COOKIE CONSENT: By continuing to browse my site you agree to its use of cookies. OK or Tell me more
Search a number
Bell numbers
Numbers which count the ways in which n objects can be partitioned into non-empty subsets. more

The Bell numbers up to 1015 :

Distribution of the remainders when the numbers in this family are divided by n=2, 3,..., 11. (I took into account 10000 values, from 1 to 1.59⋅1027664).

n\r 0  1 
233336667 2 
3307646152309 3 
41666333416673333 4 
519982047199221721791 5 
610263077769205015381540 6 
71389140514591405145714721413 7 
801666166716671666166801666 8 
951325635132561538179623075140 9 
1066313646561445604133568313367271187 10 
11883992892887923919908878903891924

A pictorial representation of the table above
motab
Imagine to divide the members of this family by a number n and compute the remainders. Should they be uniformly distributed, each remainder from 0 to n-1 would be obtained in about (1/n)-th of the cases. This outcome is represented by a white square. Reddish (resp. bluish) squares represent remainders which appear more (resp. less) frequently than 1/n.